package com.xyhuo.leetcode.november;

/**
 * 最小路径和
 * https://leetcode.cn/problems/minimum-path-sum
 *
 * @time 2023/11/23
 */
public class MinPathSum {

//    public static void main(String[] args) {
//        MinPathSum minPathSum = new MinPathSum();
//        int[][] grid = {{1, 3, 1}, {1, 5, 1}, {4, 2, 1}};
//        int result = minPathSum.minPathSum(grid);
//        System.out.println(result);
//    }

    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m][n];
        for (int i = 0; i < n; i++) {
            dp[0][i] = (i - 1 >= 0 ? dp[0][i - 1] : 0) + grid[0][i];
        }
        for (int i = 0; i < m; i++) {
            dp[i][0] = (i - 1 >= 0 ? dp[i - 1][0] : 0) + grid[i][0];
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                int upValue = i - 1 >= 0 ? dp[i - 1][j] : 0;
                int leftValue = j >= 1 ? dp[i][j - 1] : 0;
                dp[i][j] = Math.min(upValue, leftValue) + grid[i][j];
            }
        }
        return dp[m - 1][n - 1];
    }
}
